Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar
Identifieur interne : 000B25 ( Main/Exploration ); précédent : 000B24; suivant : 000B26Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar
Auteurs : Akio Fujiyoshi [Japon] ; Masakazu Suzuki (mathématicien) [Japon] ; Seiichi Uchida [Japon]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
Abstract: This paper proposes the use of a formal grammar for the verification of mathematical formulae for a practical mathematical OCR system. Like a C compiler detecting syntax errors in a source file, we want to have a verification mechanism to find errors in the output of mathematical OCR. Linear monadic context-free tree grammar (LM-CFTG) was employed as a formal framework to define “well-formed” mathematical formulae. For the purpose of practical evaluation, a verification system for mathematical OCR was developed, and the effectiveness of the system was demonstrated by using the ground-truthed mathematical document database INFTY CDB-1.
Url:
DOI: 10.1007/978-3-540-85110-3_35
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000679
- to stream Istex, to step Curation: 000671
- to stream Istex, to step Checkpoint: 000591
- to stream Main, to step Merge: 000B37
- to stream Main, to step Curation: 000B25
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar</title><author><name sortKey="Fujiyoshi, Akio" sort="Fujiyoshi, Akio" uniqKey="Fujiyoshi A" first="Akio" last="Fujiyoshi">Akio Fujiyoshi</name></author><author><name sortKey="Suzuki, Masakazu" sort="Suzuki, Masakazu" uniqKey="Suzuki M" first="Masakazu" last="Suzuki">Masakazu Suzuki (mathématicien)</name><affiliation><country>Japon</country><placeName><settlement type="city">Fukuoka</settlement><region type="province">Kyūshū</region><region type="prefecture">Préfecture de Fukuoka</region></placeName><orgName type="university" n="3">Université de Kyūshū</orgName></affiliation></author><author><name sortKey="Uchida, Seiichi" sort="Uchida, Seiichi" uniqKey="Uchida S" first="Seiichi" last="Uchida">Seiichi Uchida</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:2AEEAED63F92E6F849162AF2D81D9060F0818DC7</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-85110-3_35</idno><idno type="url">https://api.istex.fr/document/2AEEAED63F92E6F849162AF2D81D9060F0818DC7/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000679</idno><idno type="wicri:Area/Istex/Curation">000671</idno><idno type="wicri:Area/Istex/Checkpoint">000591</idno><idno type="wicri:doubleKey">0302-9743:2008:Fujiyoshi A:verification:of:mathematical</idno><idno type="wicri:Area/Main/Merge">000B37</idno><idno type="wicri:Area/Main/Curation">000B25</idno><idno type="wicri:Area/Main/Exploration">000B25</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar</title><author><name sortKey="Fujiyoshi, Akio" sort="Fujiyoshi, Akio" uniqKey="Fujiyoshi A" first="Akio" last="Fujiyoshi">Akio Fujiyoshi</name><affiliation><wicri:noCountry code="subField">University</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country></affiliation></author><author><name sortKey="Suzuki, Masakazu" sort="Suzuki, Masakazu" uniqKey="Suzuki M" first="Masakazu" last="Suzuki">Masakazu Suzuki (mathématicien)</name><affiliation wicri:level="4"><country>Japon</country><placeName><settlement type="city">Fukuoka</settlement><region type="province">Kyūshū</region><region type="prefecture">Préfecture de Fukuoka</region></placeName><orgName type="university">Université de Kyūshū</orgName><placeName><settlement type="city">Fukuoka</settlement><region type="province">Kyūshū</region><region type="prefecture">Préfecture de Fukuoka</region></placeName><orgName type="university" n="3">Université de Kyūshū</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country><placeName><settlement type="city">Fukuoka</settlement><region type="province">Kyūshū</region><region type="prefecture">Préfecture de Fukuoka</region></placeName><orgName type="university" n="3">Université de Kyūshū</orgName></affiliation></author><author><name sortKey="Uchida, Seiichi" sort="Uchida, Seiichi" uniqKey="Uchida S" first="Seiichi" last="Uchida">Seiichi Uchida</name><affiliation wicri:level="4"><country>Japon</country><placeName><settlement type="city">Fukuoka</settlement><region type="province">Kyūshū</region><region type="prefecture">Préfecture de Fukuoka</region></placeName><orgName type="university">Université de Kyūshū</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2008</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">2AEEAED63F92E6F849162AF2D81D9060F0818DC7</idno><idno type="DOI">10.1007/978-3-540-85110-3_35</idno><idno type="ChapterID">35</idno><idno type="ChapterID">Chap35</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper proposes the use of a formal grammar for the verification of mathematical formulae for a practical mathematical OCR system. Like a C compiler detecting syntax errors in a source file, we want to have a verification mechanism to find errors in the output of mathematical OCR. Linear monadic context-free tree grammar (LM-CFTG) was employed as a formal framework to define “well-formed” mathematical formulae. For the purpose of practical evaluation, a verification system for mathematical OCR was developed, and the effectiveness of the system was demonstrated by using the ground-truthed mathematical document database INFTY CDB-1.</div></front></TEI><affiliations><list><country><li>Japon</li></country><region><li>Kyūshū</li><li>Préfecture de Fukuoka</li></region><settlement><li>Fukuoka</li></settlement><orgName><li>Université de Kyūshū</li></orgName></list><tree><country name="Japon"><noRegion><name sortKey="Fujiyoshi, Akio" sort="Fujiyoshi, Akio" uniqKey="Fujiyoshi A" first="Akio" last="Fujiyoshi">Akio Fujiyoshi</name></noRegion><name sortKey="Suzuki, Masakazu" sort="Suzuki, Masakazu" uniqKey="Suzuki M" first="Masakazu" last="Suzuki">Masakazu Suzuki (mathématicien)</name><name sortKey="Suzuki, Masakazu" sort="Suzuki, Masakazu" uniqKey="Suzuki M" first="Masakazu" last="Suzuki">Masakazu Suzuki (mathématicien)</name><name sortKey="Uchida, Seiichi" sort="Uchida, Seiichi" uniqKey="Uchida S" first="Seiichi" last="Uchida">Seiichi Uchida</name><name sortKey="Uchida, Seiichi" sort="Uchida, Seiichi" uniqKey="Uchida S" first="Seiichi" last="Uchida">Seiichi Uchida</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B25 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000B25 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:2AEEAED63F92E6F849162AF2D81D9060F0818DC7
|texte= Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar
}}
| This area was generated with Dilib version V0.6.32. |  |